Finding Good Linear Codes Using a Simple Extension AlgorithmHAN, Sunghyu.IEEE transactions on information theory. 2011, Vol 57, Num 10, pp 6729-6733, issn 0018-9448, 5 p.Article

Good Linear Codes from Polynomial EvaluationsYANG DING; LINGFEI JIN; CHAOPING XING et al.IEEE transactions on communications. 2012, Vol 60, Num 2, pp 357-363, issn 0090-6778, 7 p.Article

The Average Value for the Probability of an Undetected ErrorPERRY, Patrick N; FOSSORIER, P. C.IEEE transactions on information theory. 2008, Vol 54, Num 5, pp 2372-2375, issn 0018-9448, 4 p.Article

The Weight Distribution of Some Irreducible Cyclic CodesCUNSHENG DING.IEEE transactions on information theory. 2009, Vol 55, Num 3, pp 955-960, issn 0018-9448, 6 p.Article

Computing Linear Functions by Linear Coding Over NetworksAPPUSWAMY, Rathinakumar; FRANCESCHETTI, Massimo.IEEE transactions on information theory. 2014, Vol 60, Num 1, pp 422-431, issn 0018-9448, 10 p.Article

(1 + λu)-Constacyclic codes over F_p[u]/<u^m>XIAOSHAN KAI; SHIXIN ZHU; PING LI et al.Journal of the Franklin Institute. 2010, Vol 347, Num 5, pp 751-762, issn 0016-0032, 12 p.Article

Short Additive Quaternary CodesBIERBRAUER, Jürgen; EDEL, Yves; FAINA, Giorgio et al.IEEE transactions on information theory. 2009, Vol 55, Num 3, pp 952-954, issn 0018-9448, 3 p.Article

A geometric construction of a (38, 2)-blocking set in PG(2, 13) and the related [145, 3, 133]₁₃ codeDASKALOV, Rumen.Discrete mathematics. 2008, Vol 308, Num 7, pp 1341-1345, issn 0012-365X, 5 p.Article

An Upper Bound of Singleton Type for Componentwise Products of Linear CodesRANDRIAMBOLOLONA, Hugues.IEEE transactions on information theory. 2013, Vol 59, Num 12, pp 7936-7939, issn 0018-9448, 4 p.Article

Code Enumerators and Tutte PolynomialsBRITZ, Thomas.IEEE transactions on information theory. 2010, Vol 56, Num 9, pp 4350-4358, issn 0018-9448, 9 p.Article

Classification of Griesmer codes and dual transformBOUYUKLIEV, Iliya G.Discrete mathematics. 2009, Vol 309, Num 12, pp 4047-4066, issn 0012-365X, 20 p.Article

On optimal non-projective ternary linear codesTAKENAKA, Mito; OKAMOTO, Kei; MARUTA, Tatsuya et al.Discrete mathematics. 2008, Vol 308, Num 5-6, pp 842-854, issn 0012-365X, 13 p.Conference Paper

Generalized MacWilliams identities for Z₄-Linear codesJIE CUI; JUNYING PEI.IEEE transactions on information theory. 2004, Vol 50, Num 12, pp 3302-3305, issn 0018-9448, 4 p.Article

A Unified Framework for Linear Network CodingMIN TAN; YEUNG, Raymond W; HO, Siu-Ting et al.IEEE transactions on information theory. 2011, Vol 57, Num 1, pp 416-423, issn 0018-9448, 8 p.Article

The Weight Enumerator of a Class of Cyclic CodesCHANGLI MA; LIWEI ZENG; YANG LIU et al.IEEE transactions on information theory. 2011, Vol 57, Num 1, pp 397-402, issn 0018-9448, 6 p.Article

Nonexistence of a [g_q (5, d), 5, d]_q code for 3q⁴ -4q³-2q + 1 ≤ d ≤ 3q⁴ -4q³-qCHEON, E. J; KATO, T; KIM, S. J et al.Discrete mathematics. 2008, Vol 308, Num 14, pp 3082-3089, issn 0012-365X, 8 p.Conference Paper

The Weight Distributions of the Duals of Cyclic Codes With Two ZerosCUNSHENG DING; YANG LIU; CHANGLI MA et al.IEEE transactions on information theory. 2011, Vol 57, Num 12, pp 8000-8006, issn 0018-9448, 7 p.Article

On optimal linear codes over F₅MARUTA, Tatsuya; SHINOHARA, Maori; KIKUI, Ayako et al.Discrete mathematics. 2009, Vol 309, Num 6, pp 1255-1272, issn 0012-365X, 18 p.Article

Extensions of the critical theoremBRITZ, Thomas.Discrete mathematics. 2005, Vol 305, Num 1-3, pp 55-73, issn 0012-365X, 19 p.Article

There Is No Binary [35, 10, 13] CodeTJHAI, Cen J; TOMLINSON, Martin; GRASSL, Markus et al.IEEE transactions on information theory. 2011, Vol 57, Num 9, pp 6094-6096, issn 0018-9448, 3 p.Article

Linear intersecting codesCOHEN, G; LEMPEL, A.Discrete mathematics. 1985, Vol 56, Num 1, pp 35-43, issn 0012-365XArticle

A new proof of Korzhik's result on burst distributionsSIRI KRISHAN WASAN.Linear algebra and its applications. 1984, Vol 59, pp 115-119, issn 0024-3795Article

Linear unequal error protection codes from shorter codesVAN GILS, W. J.IEEE transactions on information theory. 1984, Vol 30, Num 3, pp 544-546, issn 0018-9448Article

Optimal lower bounds for 2-query locally decodable linear codesOBATA, Kenji.Lecture notes in computer science. 2002, pp 39-50, issn 0302-9743, isbn 3-540-44147-6, 12 p.Conference Paper

A method for extending binary linear codesALLTOP, W. O.IEEE transactions on information theory. 1984, Vol 30, Num 6, pp 871-872, issn 0018-9448Article